Row Coincidences in Nonsingular Binary Matrices
نویسندگان
چکیده
Nous étudions le nombre de cöıncidences des chiffres uns dans chaque paire de lignes différentes d’une matrice binaire et inversible dont toutes les lignes contiennent la même quantité d’unités. Nous présentons des bornes pour ce nombre, et nous démontrons que ces bornes peuvent être atteintes. Que la borne inférieure peut être réalisée est démontré par moyen des exemples. Quant à la borne supérieure, nous présentons la construction de deux familles de matrices pour lesquelles cette borne est atteinte.
منابع مشابه
Matroid Decomposition REVISED EDITION
Matrix We take a detour to introduce abstract matrices. We want to acquire a good understanding of such matrices, since they not only represent matroids, but 74 Chapter 3. From Graphs to Matroids also display a lot of structural information about matroids that other ways do not. An abstract matrix B is a {0, 1} matrix with row and column indices plus a function called abstract determinant and d...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملDecay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices
It is well known that the inverse C = c i;j ] of an irreducible nonsingular symmetric tridiagonal matrix is a Green matrix, i.e. it satisses c i;j = u i v j for i j and two sequences of real numbers fu i g and fv i g. A similar result holds for nonsymmetric matrices A. There the inverse is given by four sequences fu i g; fv i g; fy i g; and fy i g: Here we characterize certain properties of A i...
متن کاملDeterministic construction of sparse binary and ternary matrices from existing binary sensing matrices
In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which supports algorithms with low computational complexity. As an application of our method, we show that a CS matrix of general row size different from p, p, pq (for...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2001